Feedback control of unstable cellular solidification fronts

We present a numerical and experimental study of feedback control of unstable cellular patterns in directional solidification (DS). The sample, a dilute binary alloy, solidifies in a 2D geometry under a control scheme which applies local heating close to the cell tips which protrude ahead of the other. For the experiments, we use a real-time image processing algorithm to track cell tips, coupled with a movable laser spot array device, to heat locally. We show, numerically and experimentally, that spacings well below the threshold for a period-doubling instability can be stabilized. As predicted by the numerical calculations, cellular arrays become stable, and the spacing becomes uniform through feedback control which is maintained with minimal heating.Comment: 4 pages, 4 figures, 1 tabl

A Comparative Look at Plea Bargaining in Australia, Canada, England, New Zealand, and the United States

In a world where the vast majority of criminal cases are resolved through some means other than the popularly depicted criminal trial, it is fundamental to a comprehensive understanding of comparative criminal procedure to study and appreciate the different mechanisms for criminal case resolution in different nations. This Article developed through a series of conversations (and ultimately a panel discussion) between six international criminal justice professionals - practicing attorneys, scholars, and judges - regarding the nature and effects of plea bargaining (and its comparative substitutes) in their respective countries. Providing a comparative look at different mechanisms for criminal case resolution, this Article examines the applicable practices and procedures in the common law nations of Australia, Canada, England, New Zealand, and the United States

A Comparative Examination of Police Interrogation of Criminal Suspects in Australia, Canada, England and Wales, New Zealand, and the United States

The interrogation process is central to the investigation and resolution of criminal matters throughout the world. It is fundamental to a comprehensive understanding of comparative criminal procedure to study and appreciate the different approaches to the interrogation process in different nations. This Article developed through a series of conversations between six international criminal justice professionals— practicing attorneys, scholars, and judges—regarding the interrogation practices and rules in their respective countries. Providing a comparative look at this important area, this Article examines the applicable practices and procedures in the common law nations of Australia, Canada, England and Wales, New Zealand, and the United States

Resolution of Linear Algebra for the Discrete Logarithm Problem Using GPU and Multi-core Architectures

In cryptanalysis, solving the discrete logarithm problem (DLP) is key to assessing the security of many public-key cryptosystems. The index-calculus methods, that attack the DLP in multiplicative subgroups of finite fields, require solving large sparse systems of linear equations modulo large primes. This article deals with how we can run this computation on GPU- and multi-core-based clusters, featuring InfiniBand networking. More specifically, we present the sparse linear algebra algorithms that are proposed in the literature, in particular the block Wiedemann algorithm. We discuss the parallelization of the central matrix--vector product operation from both algorithmic and practical points of view, and illustrate how our approach has contributed to the recent record-sized DLP computation in GF($2^{809}$).Comment: Euro-Par 2014 Parallel Processing, Aug 2014, Porto, Portugal. \<http://europar2014.dcc.fc.up.pt/\&gt

A kilobit hidden SNFS discrete logarithm computation

We perform a special number field sieve discrete logarithm computation in a 1024-bit prime field. To our knowledge, this is the first kilobit-sized discrete logarithm computation ever reported for prime fields. This computation took a little over two months of calendar time on an academic cluster using the open-source CADO-NFS software. Our chosen prime $p$ looks random, and $p--1$ has a 160-bit prime factor, in line with recommended parameters for the Digital Signature Algorithm. However, our p has been trapdoored in such a way that the special number field sieve can be used to compute discrete logarithms in $\mathbb{F}\_p^*$ , yet detecting that p has this trapdoor seems out of reach. Twenty-five years ago, there was considerable controversy around the possibility of back-doored parameters for DSA. Our computations show that trapdoored primes are entirely feasible with current computing technology. We also describe special number field sieve discrete log computations carried out for multiple weak primes found in use in the wild. As can be expected from a trapdoor mechanism which we say is hard to detect, our research did not reveal any trapdoored prime in wide use. The only way for a user to defend against a hypothetical trapdoor of this kind is to require verifiably random primes

Complexity transitions in global algorithms for sparse linear systems over finite fields

We study the computational complexity of a very basic problem, namely that of finding solutions to a very large set of random linear equations in a finite Galois Field modulo q. Using tools from statistical mechanics we are able to identify phase transitions in the structure of the solution space and to connect them to changes in performance of a global algorithm, namely Gaussian elimination. Crossing phase boundaries produces a dramatic increase in memory and CPU requirements necessary to the algorithms. In turn, this causes the saturation of the upper bounds for the running time. We illustrate the results on the specific problem of integer factorization, which is of central interest for deciphering messages encrypted with the RSA cryptosystem.Comment: 23 pages, 8 figure

Energy and eventhood: the infrastructural set piece

‘Energy and Eventhood’ considers the relationship between infrastructure and the cinematic set piece. It proposes a working definition of the set piece as a distinctly (and perhaps excessively) effortful passage or sequence, and reflects on the tendency for narrative films to incorporate infrastructural sites and structures—such as bridges, dams and pipelines—into such set pieces. A number of writers on infrastructure, as both a cultural phenomenon and a representational object, have noted the aesthetic challenge of rendering it as visible and locatable; this article examines how that difficulty becomes manifest in the infrastructural set piece. It takes as its case studies Unstoppable (2010) and Night Moves (2013), two films noted for their distinctive rhythmic expressiveness, and each one deploying the convention of the set piece in ways which exemplify and reflect on the resistance of infrastructure to narrative containment